Determinization of Resolution by an Algorithm Operating on Complete Assignments
نویسنده
چکیده
“Determinization” of resolution is usually done by employing a DPLL-like procedure that operates on partial assignments. We introduce a resolution-based SAT-solver that operates on complete assignments and give a theoretical justification for determinizing resolution in such a way. This justification is based on the notion of a point image of a resolution proof. We give experimental results confirming the viability of our approach to resolution determinization.
منابع مشابه
Optimizing Electric Vehicle Charging Through Determinization
We propose a determinization based approach to optimize the charging policies of an electric vehicle (EV) operating in a vehicle-to-grid (V2G) setting. By planning when to charge or discharge electricity from the vehicle, the long-term cost of operating the EV can be minimized, while being consistent with the owner’s preferences. For an EV operating under price uncertainty caused by the dynamic...
متن کاملA Resolution Based SAT-solver Operating on Complete Assignments
Most successful systematic SAT-solvers are descendants of the DPLL procedure and so operate on partial assignments. Using partial assignments is explained by the “enumerative semantics” of the DPLL procedure. Current clause learning SAT-solvers, in a sense, have outgrown this semantics. Instead of enumerating the search space as the DPLL procedure does, they explicitly build a resolution proof....
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملComplete resolution of chronic cutaneous leishmaniasis by combination therapy with systemic Glucantime, oral fluconazole and 50% trichloroacetic acid solution: report of one case
Cutaneous leishmaniasis is an endemic disease in Iran and there is no curative treatment. The disfiguring scar that remains after it subsides is a major psychologic and emotional problem in these patients. Chronic leishmaniasis is a rare form of this malady which is seen in 5-7 percent of cases. In this article we report a 46-year-old man who was refered to us for a large leishmaniasis lesion c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006